Parent Selection Criterion for Extracting Trees from Concept Lattices
نویسندگان
چکیده
Traditional software in Formal Concept Analysis makes little use of visualization techniques, producing poorly readable concept lattice representations when the number of concepts exceeds a few dozens. This is problematic as the number of concepts in such lattices grows significantly with the size of the data and the number of its dimensions. In this work we propose several methods to enhance the readability of concept lattices firstly though colouring and distortion techniques, and secondly by extracting and visualizing trees derived from concept lattice structures. These contributions represent an important step in the visual analysis of conceptual structures, as domain experts may visually explore larger datasets that traditional visualizations of concept lattice cannot represent effectively.
منابع مشابه
Extracting Decision Trees from Interval Pattern Concept Lattices
Formal Concept Analysis (FCA) and concept lattices have shown their effectiveness for binary clustering and concept learning. Moreover, several links between FCA and unsupervised data mining tasks such as itemset mining and association rules extraction have been emphasized. Several works also studied FCA in a supervised framework, showing that popular machine learning tools such as decision tre...
متن کاملBrowsing Large Concept Lattices through Tree Extraction and Reduction Methods
Browsing concept lattices from Formal Concept Analysis becomes a problem as the number of concepts can grow significantly with the number of objects and attributes. Interpreting the lattice through direct graph-based visualisation of the Hasse diagram rapidly becomes difficult and more synthetic representations are needed. In this work we propose an approach to simplify concept lattices by extr...
متن کاملSome Links Between Decision Tree and Dichotomic Lattice
There are two types of classification methods using a Galois lattice: as most of them rely on selection, recent research work focus on navigationbased approaches. In navigation-oriented methods, classification is performed by navigating through the complete lattice, similar to the decision tree. When defined from binary attributes obtained after a discretization pre-processing step, and more ge...
متن کاملAnalysis of Social Communities with Iceberg and Stability-Based Concept Lattices
In this paper, we presents a research work based on formal concept analysis and interest measures associated with formal concepts. This work focuses on the ability of concept lattices to discover and represent special groups of individuals, called social communities. Concept lattices are very useful for the task of knowledge discovery in databases, but they are hard to analyze when their size b...
متن کاملCharacterizing trees in property-oriented concept lattices
Property-oriented concept lattices are systems of conceptual clusters called property-oriented concepts, which are partially ordered by the subconcept/superconcept relationships. Property-oriented concept lattices are basic structures used in formal concept analysis. In general, a property-oriented concept lattice may contain overlapping clusters and is not to be a tree construction. Additional...
متن کامل